Equitable factorizations of Hamming shells

نویسنده

  • Italo J. Dejter
چکیده

We construct a 1-factorization of the complement Σm of the linear Hamming code of length m = mr = 2 r − 1 in the m-cube Qm, for r ≥ 2, having the following equitable property: its component 1-factors intersect each Cayley parallel 1-factor of Qm at a constant number of edges, (namely 2r edges). In the way to that construction, we find an equitable mr−1-factorization of Σm formed by two factors Ωr,Ω ′ r, specifically two spanning regular subgraphs, selfcomplementary in Σm. These results were already known for r ≤ 3, where Ω3 and Ω ′ 3 coincide with the so-called Foster graph.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Equitable facto rtzations of Hamming shells *

We construct a l-factorizalion of the complement .E, of the linear Hamming code of length m:m,--2'-l in the z-cube Q^, for r ) 2,havitg the following equitable property: its component l-factors intersect each Cayley parallel l-factor of Q^ at a constant number of edges, (namely 2mr-r-t edges). In the way to that construction, we flnd an equitable m,-t-factorization of 2, formed by two factors Q...

متن کامل

Symmetry of Factors of the 7-Cube Hamming Shell

A 1-factorization F1 of the complement Σ7 of the perfect Hamming code in the 7cube graphQ7 is given explicitly. For i = 2, 3, the component 1-factors ofF1 can be reunited to form i-factorizations Fi of Σ7 for which the component i-factors are pairwise isomorphic. The smallest connected factors that can be obtained as edge-subset unions from factors of these two factorizations show differing tra...

متن کامل

On the binary codes with parameters of triply-shortened 1-perfect codes

We study properties of binary codes with parameters close to the parameters of 1-perfect codes. An arbitrary binary (n = 2 − 3, 2n−m−1, 4) code C, i.e., a code with parameters of a triply-shortened extended Hamming code, is a cell of an equitable partition of the n-cube into six cells. An arbitrary binary (n = 2−4, 2, 3) codeD, i.e., a code with parameters of a triply-shortened Hamming code, is...

متن کامل

Cyclic type factorizations of complete bipartite graphs into hypercubes

So far, the smallest complete bipartite graph which was known to have a cyclic type decomposition into cubes Qd of a given dimension d was Kd2d−2,d2d−2. Using binary Hamming codes we prove in this paper that there exists a cyclic type factorization of K2d−1,2d−1 into Qd if and only if d is a power of 2.

متن کامل

Computation of Minimum Hamming Weight for Linear Codes

In this paper, we consider the minimum Hamming weight for linear codes over special finite quasi-Frobenius rings. Furthermore, we obtain minimal free $R$-submodules of a finite quasi-Frobenius ring $R$  which contain a linear code and derive the relation between their minimum Hamming weights. Finally, we suggest an algorithm that computes this weight using the Grobner basis and we show that und...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Discrete Mathematics

دوره 261  شماره 

صفحات  -

تاریخ انتشار 2003